Good shadows, dynamics and convex hulls of complete submanifolds

نویسنده

  • F. Fontenele
چکیده

Any non-empty open convex subset of Rn is the convex hull of a complete submanifold M , of any codimension, but there are obstructions if the geometry of M is, a priori, suitably controlled at infinity. In this paper we develop tools to explore the geometry of ∂[Conv(M)] when the Grassmanian-valued Gauss map of M is uniformly continuous, a condition that, in the C2 case, is weaker than bounding the second fundamental form of M . Our proofs are based on the Ekeland variational principle, and on a conceptual refinement of the Omori-Yau asymptotic maximum principle that is of interest in its own right. If the Ricci (sectional) curvature of M is bounded below and f is a C2 function on M that is bounded above, then not only there exists some maximizing sequence for f with good properties, as predicted by the Yau (Omori) principle but, in fact, every maximizing sequence for f can be shadowed by a maximizing sequence that has good properties. This abundance of good shadows allows for information to be localized at infinity, revealing in our geometric setting the relation between the asymptotic behavior of M and the supporting hyperplanes of ∂[Conv(M)] in general position that pass through some fixed boundary point. We also use ideas from dynamics to prove a special case of a conjecture meant to extend our refinement of the Yau maximum principle to manifolds that satisfy a property weaker than inf Ric > −∞. The authors expect that this new understanding of the Omori-Yau principle – in terms of good shadows and localization at infinity – will lead to applications in contexts other than convexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Horoball Hulls and Extents in Positive Definite Space

The space of positive definite matrices P(n) is a Riemannian manifold with variable nonpositive curvature. It includes Euclidean space and hyperbolic space as submanifolds, and poses significant challenges for the design of algorithms for data analysis. In this paper, we develop foundational geometric structures and algorithms for analyzing collections of such matrices. A key technical contribu...

متن کامل

White Space Regions

We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white). The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points. In other words, these convex hulls make i...

متن کامل

Mean Curvature Flow with Convex Gauss Image

We study the mean curvature flow of complete space-like submanifolds in pseudo-Euclidean space with bounded Gauss image, as well as that of complete submanifolds in Euclidean space with convex Gauss image. By using the confinable property of the Gauss image under the mean curvature flow we prove the long time existence results in both cases. We also study the asymptotic behavior of these soluti...

متن کامل

Description of Some of my Recent Research Work

My recent research work has focused on numerous problems in Complex Analysis of Several Variables which are also related to questions in non-linear analysis, partial differential equations, differential geometry and classical dynamics. More specifically, I have been working on the following topics: (1). Normal form theory and holomorphic equivalence problem of real submanifolds in a complex man...

متن کامل

Quality control of oceanographic in situ data from Argo floats using climatological convex hulls

A new method of identifying anomalous oceanic temperature and salinity (T/S) data from Argo profiling floats is proposed. The proposed method uses World Ocean Database 2013 climatology to classify good against anomalous data by using convex hulls. An n-sided polygon (convex hull) with least area encompassing all the climatological points is constructed using Jarvis March algorithm. Subsequently...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009